/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
vector<int> ve[maxn];
int n, d;
int fa[maxn][22];
void dfs(int u)
{
    for (int i = 0; i < ve[u].size(); i++)
    {
        int v = ve[u][i];
        if (v == fa[u][0])
            continue;
        fa[v][0] = u;
        dfs(v);
    }
}
int main()
{
    IOS;
    cin >> n >> d;

    for (int i = 2; i <= n; i++)
    {
        int x;
        cin >> x;
        ve[x].push_back(i);
    }

    fa[1][0] = 0;
    dfs(1);

    for (int j = 1; j < 22; j++)
    {
        for (int i = 1; i <= n; i++)
        {
            fa[i][j] = fa[fa[i][j - 1]][j - 1];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        int now = i, dd = d;
        for (int j = 21; j >= 0; j--)
        {
            if (dd & (1 << j))
            {
                now = fa[now][j], dd ^= 1 << j;
                //cout << i << ',' << j << ":" << now << endl;
            }

            if (!now)
                break;
        }
        //cout << i << ',' << now << ',' << dd << endl;
        if (now && !dd)
            cout << now << endl;
        else
            cout << -1 << endl;
    }
    getchar();
    getchar();
    return 0;
}
